'

\ufeffgiven linear code block with generating matrix 15,3 \ufeffG= \ufeff

1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 \ufeff

0 1 0 0 1 0 0 1 0 0 1 0 0 1 0

\ufeff0 0 1 0 0 1 0 0 1 0 0 1 0 0 1

find a case of 5 \ufefferrors that the code unable to recognise and case of 12 \ufefferrors the code can recognise

also find a case the of 6 \ufefferros the code can fix and case of 4 \ufefferros the code unable to fix

the question is not asking if the code capable to do it for all cases. it is question of find specific case that it can or cannot do , \ufefffor example burst errors cases

as I tried:

6errors case can fix:

111111111100100 \ufeffin this case original data bits didnt change so the code can fix it

4 \ufefferros cant fix:

011000100100100 \ufeffbecause 2 \ufeffdata bits changed

12 \ufefferros ;

for example

e=111111111000111 \ufeffthis will be syndrom (1,1,1) \ufeffso code recognising there are errors

case of 5 \ufeffthat cant recognise I couldnt find because from 5 \ufefferros cant build syndrom of 0,0,0,

are my answer correct?